QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantile Approximation for Robust Statistical Estimation and k-Enclosing Problems

Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P . Well-known instances of this problem include finding the smallest enclosing box, minimum volume ball, and minimum volume annulus. In this paper we consider the following variant: Given a set of n points in Rd, find the sma...

متن کامل

Quantile approximation for robust statistical estimation

Given a set P of n points in R d , a fundamental problem in computational geometry is concerned with nding the smallest enclosing \range" of P. Well known instances of this problem include nding, e.g., the smallest enclosing box 10], smallest enclosing simplex 11], minimum volume ball 17, 20], (2-D) smallest enclosing ellipsoid 16, 20, 2, 14], and minimum volume annulus 1, 8, 5]. In this paper,...

متن کامل

Sparse Quantile Huber Regression for Efficient and Robust Estimation

We consider new formulations and methods for sparse quantile regression in the high-dimensional setting. Quantile regression plays an important role in many applications, including outlier-robust exploratory analysis in gene selection. In addition, the sparsity consideration in quantile regression enables the exploration of the entire conditional distribution of the response variable given the ...

متن کامل

Computing the Smallest k-Enclosing Circle and Related Problems

We present an e cient algorithm for solving the \smallest k-enclosing circle" ( kSC ) problem: Given a set of n points in the plane and an integer k n, nd the smallest disk containing k of the points. We present two solutions. When using O(nk) storage, the problem can be solved in time O(nk log 2 n). When only O(n logn) storage is allowed, the running time is O(nk log 2 n log n k ). This proble...

متن کامل

Pointwise adaptive estimation for robust and quantile regression∗

A nonparametric procedure for robust regression estimation and for quantile regression is proposed which is completely data-driven and adapts locally to the regularity of the regression function. This is achieved by considering in each point M-estimators over different local neighbourhoods and by a local model selection procedure based on sequential testing. Nonasymptotic risk bounds are obtain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Geometry & Applications

سال: 2000

ISSN: 0218-1959,1793-6357

DOI: 10.1142/s0218195900000334